The Cicchetti-Allison weighting matrix is positive definite
نویسنده
چکیده
Application of Cohen’s weighted kappa for inter-rater agreement requires the specification of a weighting matrix. An explicit formula for the determinants of the principal minors of the weighting matrix with Cicchetti–Allison weights is derived. Since all determinants are strictly positive, it follows that the Cicchetti–Allison weighting matrix is positive definite. © 2012 Elsevier B.V. All rights reserved. 1. Weighted kappa Analysis of agreement between two raters is often used to assess the reliability of a categorical rating system. The raters may be pathologists that rate the severity of lesions from scans (Crewson, 2005; Kundel and Polansky, 2003) or competing diagnostic devices that classify the extent of disease in patients into ordinal categories (Warrens, 2012). High agreement between the ratings indicates consensus in the diagnosis and interchangeability of the measuring devices. Standard tools for assessing agreement are the descriptive statistics unweighted kappa for ratings on a nominal scale (Cohen, 1960; Yang and Chinchilli, 2009; Warrens, 2010) and weighted kappa for ratings on an ordinal scale (Cohen, 1968; Warrens, 2013). Weighted kappa allows the assignment of weights to describe the closeness of agreement between the n ≥ 2 categories. Let wij ∈ [0, 1] denote the agreement weight between categories i and j (i, j ∈ {1, 2, . . . , n}). The equality wij = 1 reflects that there is perfect agreement when a target is assigned to category i by rater 1 and category j by rater 2, whereas 0 < wjk < 1 reflects some disagreement when a target is assigned to different categories by the raters. The most popular weighting matrix (Maclure and Willett, 1987; Graham and Jackson, 1993) is the matrix with quadratic weights (Fleiss and Cohen, 1973; Warrens, 2012). Another popular weighting matrix is the matrix with linear weights (Cicchetti and Allison, 1971; Vanbelle and Albert, 2009; Warrens, 2011) given by Wn = 1 − |i − j| n − 1 i,j∈{1,2,...,n} = 1 n − 2 n − 1 · · · 1 n − 1 0 n − 2 n − 1 1 · · · 2 n − 1 1 n − 1 .. .. . . . .. .. 1 n − 1 2 n − 1 · · · 1 n − 2 n − 1 0 1 n − 1 · · · n − 2 n − 1 1 . ∗ Tel.: +31 71 527 6696; fax: +31 71 527 3619. E-mail address:[email protected]. 0167-9473/$ – see front matter© 2012 Elsevier B.V. All rights reserved. doi:10.1016/j.csda.2012.09.019 M.J. Warrens / Computational Statistics and Data Analysis 59 (2013) 180–182 181 Yang and Chinchilli (2011, p. 1064) conjecture that the n× nmatrixWn with Cicchetti–Allison weights is non-negative definite. The non-negative definite nature of a weighting matrix is a sufficient condition for the existence of a representation of the categories in Euclidean space (Gower, 1966). The weighting matrix can thus be subjected to various multivariate data analysis techniques. In the next section we show that Yang and Chinchilli’s conjecture is correct by proving that the matrix Wn is positive definite. 2. Cicchetti–Allison weights Fix n ≥ 2, letm ∈ {1, 2, . . . , n}, and consider them × mmatrix U (n) m = n − 1 n − 2 · · · n − m + 1 n − m n − 2 n − 1 · · · n − m + 2 n − m + 1 .. .. . . . .. .. n − m + 1 n − m + 2 · · · n − 1 n − 2 n − m n − m + 1 · · · n − 2 n − 1 . We have the following expression for the determinant of U (n) m . Lemma. detU (n) m = (2n − m − 1)2m−2. Proof. We use the property that adding a scalar multiple of one row (column) to another row (column) does not change the value of the determinant (see, e.g. Bloom, 1979, p. 306). If we keep the first row unaltered and replace for i ≥ 2 the i-th row by the difference between the (i − 1)-th and i-th row, we obtain detU (n) m = n − 1 n − 2 n − 3 · · · n − m 1 −1 −1 · · · −1 1 1 −1 · · · −1 .. .. . . . .. 1 1 1 · · · −1 . Next, if we keep the first column unaltered and replace for i ≥ 2 the i-th column by the difference between the (i − 1)-th and i-th column, we obtain detU (n) m = n − 1 1 1 · · · 1 1 2 0 · · · 0 1 0 2 0 .. .. . . . .. 1 0 0 · · · 2 .
منابع مشابه
Nonstationary Multisplittings with General Weighting Matrices
In the convergence theory of multisplittings for symmetric positive definite (s.p.d.) matrices it is usually assumed that the weighting matrices are scalar matrices, i.e., multiples of the identity. In this paper, this restrictive condition is eliminated. In its place it is assumed that more than one (inner) iteration is performed in each processor (or block). The theory developed here is appli...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملApproximating the Distributions of Singular Quadratic Expressions and their Ratios
Noncentral indefinite quadratic expressions in possibly non- singular normal vectors are represented in terms of the difference of two positive definite quadratic forms and an independently distributed linear combination of standard normal random variables. This result also ap- plies to quadratic forms in singular normal vectors for which no general representation is currently available. The ...
متن کاملNon-stationary Parallel Multisplitting Two-Stage Iterative Methods with Self-AdaptiveWeighting Schemes
In this paper, we study the non-stationary parallel multisplitting two-stage iterative methods with selfadaptive weighting matrices for solving a linear system whose coefficient matrix is symmetric positive definite. Two choices of Self-adaptive weighting matrices are given, especially, the nonnegativity is eliminated. Moreover, we prove the convergence of the non-stationary parallel multisplit...
متن کاملStochastic optimal LQR control with integral quadratic constraints and indefinite control weights
A standard assumption in traditional (deterministic and stochastic) optimal (minimizing) linear quadratic regulator (LQR) theory is that the control weighting matrix in the cost functional is strictly positive definite. In the deterministic case, this assumption is in fact necessary for the problem to be wellposed because positive definiteness is required to make it a convex optimization proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computational Statistics & Data Analysis
دوره 59 شماره
صفحات -
تاریخ انتشار 2013